A New Heuristic in Mutual Sequential Mate Search
نویسندگان
چکیده
منابع مشابه
Simple Heuristics as Equilibrium Strategies in Mutual Sequential Mate Search
In this paper, we study whether simple heuristics can arise as equilibrium strategies in mutual sequential mate search. To this aim, we extend the mate search model of Todd and Miller (1999), involving an adolescence (learning) phase followed by an actual mating phase, to a strategic game where the players, as the individuals in the mating population, choose before starting the adolescence phas...
متن کاملPSEUDO-RANDOM DIRECTIONAL SEARCH: A NEW HEURISTIC FOR OPTIMIZATION
Meta-heuristics have already received considerable attention in various fields of engineering optimization problems. Each of them employes some key features best suited for a specific class of problems due to its type of search space and constraints. The present work develops a Pseudo-random Directional Search, PDS, for adaptive combination of such heuristic operators. It utilizes a short term...
متن کاملSimulating the Mutual Sequential Mate Search Model under Non-homogenous Preferences
This paper extends the Todd and Miller’s (1999) mutual sequential mate search model with homogenous preferences to the case of non-homogenous preferences. Our simulations show that the size of heterogeneity in the preferences affects the performance rankings -as well as the absolute success levelsof the mate search heuristics in the model with respect to both mating likelihood and mating stabil...
متن کاملGene-Machine, a new search heuristic algorithm
This paper introduces Gene-Machine, an efficient and new search heuristic algorithm, based in the building-block hypothesis [1] [2]. It is inspired by natural evolution, but does not use some of the concepts present in genetic algorithms like population, mutation and generation. This heuristic exhibits good performance in comparison with genetic algorithms, and can be used to generate useful so...
متن کاملPotential Search: A New Greedy Anytime Heuristic Search
In this paper we explore a novel approach for anytime heuristic search, in which the node that is most probable to improve the incumbent solution is expanded first. This is especially suited for the ”anytime aspect” of anytime algorithms the possibility that the algorithm will be be halted anytime throughout the search. The potential of a node to improve the incumbent solution is estimated by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2017
ISSN: 1556-5068
DOI: 10.2139/ssrn.2976502